The spectral dimension of random brushesJONSSON, Thordur; ÖRN STEFANSSON, Sigurour.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 4, issn 1751-8113, 045005.1-045005.10Article

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

Hypernetworks as tools for modelling multiport systemsGATTINGER, M; WENZEL, G.Journal of the Franklin Institute. 1984, Vol 37, Num 1, pp 1-6, issn 0016-0032Article

A comparative analysis of the performance of Taguchi's linear graphs for the design of two-level fractional factorialsBISGAARD, S.Applied statistics. 1996, Vol 45, Num 3, pp 311-322, issn 0035-9254Article

A geometric growth model interpolating between regular and small-world networksZHONGZHI ZHANG; SHUIGENG ZHOU; ZHIYONG WANG et al.Journal of physics. A, Mathematical and theoretical (Print). 2007, Vol 40, Num 39, pp 11863-11876, issn 1751-8113, 14 p.Article

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

Taguchi methods: linear graphs of high resolutionCZITROM, V.Communications in statistics. Theory and methods. 1989, Vol 18, Num 12, pp 4583-4606, issn 0361-0926Article

On distance-preserving and domination elimination orderingsCHEPOI, V.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 3, pp 414-436, issn 0895-4801Article

Analysis of dynamic behaviour for power transmission mechanism using linear graph theoryWATANUKI, K; OHTAKI, H; ISHIKAWA, Y et al.SAE transactions. 1987, Vol 96, Num 3, pp 1176-1183, issn 0096-736XArticle

An O(n) time algorithm for maximum matching in P₄-tidy graphsFOUQUET, J. L; PARFENOFF, I; THUILLIER, H et al.Information processing letters. 1997, Vol 62, Num 6, pp 281-287, issn 0020-0190Article

More on rectangles tiles by rectanglesMEAD, D. G; STEIN, S. K.The American mathematical monthly. 1993, Vol 100, Num 7, pp 641-643, issn 0002-9890Article

Adding an edge in a cographNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 214-226, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 13 p.Conference Paper

A conjecture of Berge about linear hypergraphs and Steiner systems S(2,4,v)GIONFRIDDO, Lucia.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 125-133, issn 0012-365XConference Paper

Improving Taguchi's packaging of fractional factorial designsROBINSON, G. K.Journal of quality technology. 1993, Vol 25, Num 1, pp 1-11, issn 0022-4065Article

LINE PERFECT GRAPHS.TROTTER LE JR.1977; MATH. PROGRAMMG; NETHERL.; DA. 1977; VOL. 12; NO 2; PP. 255-259; BIBL. 17 REF.Article

ON BLOCKING PROBABILITIES FOR SWITCHING NETWORKS.CHUNG FRK; HWANG FK.1977; BELL SYST. TECH. J.; U.S.A.; DA. 1977; VOL. 56; NO 8; PP. 1431-1446; BIBL. 13 REF.Article

GRAPH EQUATIONS FOR LINE GRAPHS, TOTAL GRAPHS AND MIDDLE GRAPHS.AKIYAMA J; HAMADA T; YOSHIMURA I et al.1976; TRU MATH.; JAP.; DA. 1976; VOL. 12; NO 2; PP. 31-34; BIBL. 5 REF.Article

A PROBLEM ON BLOCKING PROBABILITIES IN CONNECTING NETWORKS.CHUNG FRK; HWANG FK.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 2; PP. 185-192; BIBL. 4 REF.Article

ON BLOCKING PROBABILITIES FOR A CLASS OF LINEAR GRAPHSCHUNG K; HWANG FK.1978; BELL SYST. TECH. J.; USA; DA. 1978; VOL. 57; NO 8; PP. 2915-2925; BIBL. 2 REF.Article

ON N-HAMILTONIAN LINE GRAPHS.LESNIAK FOSTER L.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 263-273; BIBL. 7 REF.Article

Finding common structured patterns in linear graphsFERTIN, Guillaume; HERMELINB, Danny; RIZZI, Romeo et al.Theoretical computer science. 2010, Vol 411, Num 26-28, pp 2475-2486, issn 0304-3975, 12 p.Article

Unicyclic graphs with exactly two main eigenvaluesYAOPING HOU; FENG TIAN.Applied mathematics letters. 2006, Vol 19, Num 11, pp 1143-1147, issn 0893-9659, 5 p.Article

A coding approach to signed graphsSOLE, P; ZASLAVSKY, T.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 4, pp 544-553, issn 0895-4801Article

Regular factors of line graphsNISHIMURA, T.Discrete mathematics. 1990, Vol 85, Num 2, pp 215-219, issn 0012-365X, 5 p.Article

The mathematical foundations of bond graphs. IV: Matrix representations and causalityBIRKETT, S. H; ROE, P. H.Journal of the Franklin Institute. 1990, Vol 327, Num 1, pp 109-128, issn 0016-0032, 20 p.Article